Strongly multiplicative labeling of certain tree derived networks

Strongly Multiplicative Labeling in the Context of Arbitrary Supersubdivision

We investigate some new results for strongly multiplicative labeling of graph. We prove that the graph obtained by arbitrary supersubdivision of tree T , grid graph Pn × Pm, complete bipartite graph Km,n, Cn Pm and one-point union of m cycle of length n are strongly multiplicative.

Strongly Multiplicative Labeling of Some Snake Related Graphs

Abstract: A graph G with p vertices is said to be strongly multiplicative if the vertices of G can be labeled with p consecutive positive integers 1, 2, ..., p such that label induced on the edges by the product of labels of end vertices are all distinct. In this paper we investigate strongly multiplicative labeling of some snake related graphs. We prove that alternate triangular snake and alte...

On strongly 2-multiplicative graphs

In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative

The Maximum Number of Edges in a Strongly Multiplicative Graph

the maximum number of edges in a strongly multiplicative graph

0